Project-Team:MARELLE

Project-Team Marelle

Members

Overall Objectives

Research Program

Type theory and formalization of mathematics
Verification of scientific algorithms
Programming language semantics

Application Domains

Reliability of embedded software
Security and Cryptography
Mathematics and Education

New Software and Platforms

Coq
Easycrypt
Math-Components
Ssreflect
Zoocrypt

New Results

IDE for Coq
ELPI, Fast, Embeddable, λ-Prolog Interpreter
Verified Proofs of Higher-Order Masking
Relational Reasoning via Probabilistic Coupling
Automated Proofs of Pairing-Based Cryptography
Improvements on CBC MAC formalized in EasyCrypt
Buchberger's algorithm and advanced formalization of multinomials
Proofs that e and π and transcendental
Algorithms for Real Algebraic Geometry
Nominal sets in Coq
Formal Description of Dynamic Logic
Cubical Type Theory
Finite set and finite maps
Formalization of a Newton Series Representation of Polynomials
Formal description of catalan numbers
Latex to XML translator

Bilateral Contracts and Grants with Industry

Bilateral Contracts with Industry

Partnerships and Cooperations

National Initiatives
European Initiatives
International Initiatives
International Research Visitors

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries

Bibliography

Major publications
Publications of the year

Inria | Raweb 2015 | Presentation of the Project-Team MARELLE | MARELLE Web Site


	PDF	e-Pub

Previous |

Home | Next next

Section: New Software and Platforms

Easycrypt

Functional Description

EasyCrypt is a toolset for reasoning about relational properties of probabilistic computations with adversarial code. Its main application is the construction and verification of game-based cryptographic proofs. EasyCrypt can also be used for reasoning about differential privacy.

Participants: Gilles Barthe, Benjamin Grégoire and Pierre-Yves Strub
Contact: Gilles Barthe
URL: https://www.easycrypt.info/trac/

Previous |

Home | Next next